منابع مشابه
The Complexity of a Counting Finite-State Automaton
A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complexity of recognizing its range as a set of binary strings. We also consider the pumping behavior of counting ...
متن کامل1 the Complexity of a Counting Finite - State Automaton
A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complexity of recognizing its range as a set of binary strings. We also consider the pumping behavior of counting ...
متن کاملA New Kind of Finite-State Automaton: Register Vector Grammar
Register Vector Grammar is a new kind of f in i te -s ta te automaton that is sensitive to context—without, of course, being contextsensitive in the sense of Chomsky hierarchy. Traditional automata are functionally simple: symbols match by identi ty and change by replacement. RVG is functionally complex: ternary feature vectors (e.g. +-±--++) match and change by masking ( + matches but does not...
متن کاملLearning Diagnosis Based on Evolving Fuzzy Finite State Automaton
Nowadays, determining faults (or critical situations) in nonstationary environment is a challenging task in complex systems such as Nuclear center, or multi-collaboration such as crisis management. A discrete event system or a fuzzy discrete event system approach with a fuzzy role-base may resolve the ambiguity in a fault diagnosis problem especially in the case of multiple faults (or multiple ...
متن کاملDoes a Rock Implement Every Finite-State Automaton?
Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finite-state automaton. I argue that Putnam’s argument fails, but that it points out the need for a better understanding of the bridge between the theory of computation and the theory of physical systems: the relation of implementatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1981
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.17.206